Online algorithm

Results: 302



#Item
51On Randomized Online Scheduling Susanne Albers   Freiburg University

On Randomized Online Scheduling Susanne Albers  Freiburg University

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:04:17
52Online Scheduling of Simple Linear Deteriorating Jobs to Minimize Total General Completion Time Sheng Yu∗ †

Online Scheduling of Simple Linear Deteriorating Jobs to Minimize Total General Completion Time Sheng Yu∗ †

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2012-11-18 07:18:02
53CS369N: Beyond Worst-Case Analysis Lecture #8: Resource Augmentation∗ Tim Roughgarden† November 28,

CS369N: Beyond Worst-Case Analysis Lecture #8: Resource Augmentation∗ Tim Roughgarden† November 28,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2011-10-07 01:14:07
54Average Case Analyses of List Update Algorithms, with Applications to Data Compression Susanne Albers Michael Mitzenmachery

Average Case Analyses of List Update Algorithms, with Applications to Data Compression Susanne Albers Michael Mitzenmachery

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:06:41
55Online Algorithms Susanne Albers Stefano Leonardiy  Over the past twelve years, online algorithms have received considerable research interest. Online

Online Algorithms Susanne Albers Stefano Leonardiy Over the past twelve years, online algorithms have received considerable research interest. Online

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:05:41
56Adaptive Subgradient Methods  Adaptive Subgradient Methods for Online Learning and Stochastic Optimization∗ John Duchi

Adaptive Subgradient Methods Adaptive Subgradient Methods for Online Learning and Stochastic Optimization∗ John Duchi

Add to Reading List

Source URL: stanford.edu

Language: English - Date: 2014-09-05 13:17:02
57A note on “An optimal online algorithm for single machine scheduling to minimize total general completion time” Sheng Yu∗ School of Management Xi’an Jiaotong University

A note on “An optimal online algorithm for single machine scheduling to minimize total general completion time” Sheng Yu∗ School of Management Xi’an Jiaotong University

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2011-09-26 11:59:54
    58CS261: A Second Course in Algorithms Lecture #11: Online Learning and the Multiplicative Weights Algorithm∗ Tim Roughgarden† February 9, 2016

    CS261: A Second Course in Algorithms Lecture #11: Online Learning and the Multiplicative Weights Algorithm∗ Tim Roughgarden† February 9, 2016

    Add to Reading List

    Source URL: theory.stanford.edu

    Language: English - Date: 2016-02-16 16:06:28
    59ELSEVIER  Information Processing

    ELSEVIER Information Processing

    Add to Reading List

    Source URL: www.maths.lse.ac.uk

    Language: English - Date: 2004-07-14 08:53:51
    60A Lyapunov Based Stable Online Learning Algorithm For Nonlinear Dynamical Systems Using Extreme Learning Machines Vijay Manikandan Janakiraman∗ , XuanLong Nguyen† , Dennis Assanis‡ ∗ Department  of Mechanical Eng

    A Lyapunov Based Stable Online Learning Algorithm For Nonlinear Dynamical Systems Using Extreme Learning Machines Vijay Manikandan Janakiraman∗ , XuanLong Nguyen† , Dennis Assanis‡ ∗ Department of Mechanical Eng

    Add to Reading List

    Source URL: dept.stat.lsa.umich.edu

    Language: English - Date: 2013-05-02 00:04:07